Distributed Hypothesis Testing Over Orthogonal Discrete Memoryless Channels
نویسندگان
چکیده
A distributed binary hypothesis testing problem is studied in which multiple helpers transmit their observations to a remote detector over orthogonal discrete memoryless channels. The detector uses the received samples from the helpers along with its own observations to test for the joint distribution of the data. Single-letter inner and outer bounds for the type 2 error exponent (T2EE) is established for the special case of testing against conditional independence (TACI). Specializing this result for the one-helper problem, a single-letter characterization of the optimal T2EE is obtained. For the general hypothesis testing problem, a lower bound on the T2EE is established by using a separation based scheme that performs independent channel coding and hypothesis testing. It is shown that this separation based scheme recovers the optimal T2EE previously obtained when specialized for the case of TACI. Finally, a joint hypothesis testing and channel coding scheme based on hybrid coding is proposed and the T2EE achievable under this scheme is analyzed. In general, this scheme is expected to achieve a better performance compared to the separation based scheme.
منابع مشابه
Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملThe Method of Types - Information Theory, IEEE Transactions on
The method of types is one of the key technical tools in Shannon Theory, and this tool is valuable also in other fields. In this paper, some key applications will be presented in sufficient detail enabling an interested nonspecialist to gain a working knowledge of the method, and a wide selection of further applications will be surveyed. These range from hypothesis testing and large deviations ...
متن کاملOn the Reliability Function of the Common-Message Broadcast Channel with Variable-Length Feedback
We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically degraded. For the achievability part, we adapt Yamamoto and Itoh’s coding scheme by controlling the expectation of the maximum of a set of stopping times. For the co...
متن کاملExtension of source coding theorems for block codes to sliding-block codes
J. Kiimer and K. Marton, “General broadcast channels with degraded message sets,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 60-64, 1977. G. S. Poltyrev, lecture at the Hungarian-Soviet-Czechoslovak Seminar on Information Theory, Tsahkadsor, Sept. lo17, 1978. I. C.&z.&, J. Khmer, and K. Marton, “A new look at exponential error bounds for memoryless channels,” Preprint presented at the 1977 IEE...
متن کاملGaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018